Quasi-newton Approach to Nonnegative Image Restorations
نویسنده
چکیده
Image restoration, or deblurring, is the process of attempting to correct for degradation in a recorded image. Typically the blurring system is assumed to be linear and spatially invariant, and fast Fourier transform based schemes result in eecient computational image restoration methods. However, real images have properties that cannot always be handled by linear methods. In particular, an image consists of positive light intensities, and thus a nonnegativity constraint should be enforced. This constraint and other ways of incorporating a priori information have been suggested in various applications, and can lead to substantial improvements in the reconstructions. Nevertheless, such constraints are rarely implemented because they lead to non-linear problems which require demanding computations. We suggest eecient implementations for three nonnegatively constrained restorations schemes: constrained least squares, maximum likelihood and maximum entropy. We show that with a certain parameterization, and using a Quasi-Newton scheme, these methods are very similar. In addition, our formulation reveals a connection between our approach for maximum likelihood and the expectation-maximization method used extensively by astronomers. Numerical experiments illustrate that our approach is superior to expectation-maximization both in terms of accuracy and eeciency.
منابع مشابه
Quasi - Newton Approach to Nonnegative
Image restoration, or deblurring, is the process of attempting to correct for degradation in a recorded image. Typically the blurring system is assumed to be linear and spatially invariant, and fast Fourier transform based schemes result in eecient computational image restoration methods. However, real images have properties that cannot always be handled by linear methods. In particular, an ima...
متن کاملNewton-Based Optimization for Nonnegative Tensor Factorizations
Tensor factorizations with nonnegative constraints have found application in analyzing data from cyber traffic, social networks, and other areas. We consider application data best described as being generated by a Poisson process (e.g., count data), which leads to sparse tensors that can be modeled by sparse factor matrices. In this paper we investigate efficient techniques for computing an app...
متن کاملA Symmetric Rank-one Quasi Newton Method for Non-negative Matrix Factorization
As we all known, the nonnegative matrix factorization (NMF) is a dimension reduction method that has been widely used in image processing, text compressing and signal processing etc. In this paper, an algorithm for nonnegative matrix approximation is proposed. This method mainly bases on the active set and the quasi-Newton type algorithm, by using the symmetric rank-one and negative curvature d...
متن کاملNonnegative matrix factorization with constrained second-order optimization
Nonnegative Matrix Factorization (NMF) solves the following problem: find nonnegative matrices A ∈ RM×R + and X ∈ RR×T + such that Y ∼= AX, given only Y ∈ RM×T and the assigned index R. This method has found a wide spectrum of applications in signal and image processing, such as blind source separation, spectra recovering, pattern recognition, segmentation or clustering. Such a factorization is...
متن کاملA Modified Digital Image Watermarking Scheme Based on Nonnegative Matrix Factorization
This paper presents a modified digital image watermarking method based on nonnegative matrix factorization. Firstly, host image is factorized to the product of three nonnegative matrices. Then, the centric matrix is transferred to discrete cosine transform domain. Watermark is embedded in low frequency band of this matrix and next, the reverse of the transform is computed. Finally, watermarked ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000